????-Additive Quasi-Cyclic Codes
نویسندگان
چکیده
We study the codes of title by CRT method, that decomposes such into constituent codes, which are shorter over larger alphabets. Criteria on these for self-duality and linear complementary duality decomposed derived. The special class one-generator is given a polynomial representation exactly enumerated. In particular, we present some illustrative examples binary optimal with respect to Griesmer bound derived from $\mathbb {Z}_{2} \mathbb {Z}_{4}$ -additive quasi-cyclic codes.
منابع مشابه
Cyclic additive codes and cyclic quantum stabilizer codes
The theory of cyclic linear codes in its ring-theoretic formulation is a core topic of classical coding theory. A simplified approach is in my textbook [1]. The language of ring theory is not needed. We will present a self-contained description of the more general theory of cyclic additive codes using the same method. This includes cyclic quantum stabilizer codes as a special case. The basic in...
متن کاملQuasi-cyclic subcodes of cyclic codes
We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration is equivalent to enumeration of certain vector subspaces in finite fields. In particular, we present enumeration results for quasi-cyclic subcodes of the si...
متن کاملGood Quasi-Cyclic Codes Derived From Irreducible Cyclic Codes
As a generalization of cyclic codes, quasi-cyclic codes contain many good linear codes. Extensive search is made and lots of good quasi-cyclic codes are obtained from irreducible cyclic codes. A new binary [95, 13, 40] code which improves the lower bound on the minimum distance, is also constructed. Index Term — Codes and coding, linear codes, cyclic codes, idempotent, irreducible codes, quasi-...
متن کاملOn cyclic codes and quasi-cyclic codes over Zq + uZq
Let R = Zq + uZq, where q = p and u = 0. In this paper, some structural properties of cyclic codes and quasi-cyclic (QC) codes over the ring R are considered. A QC code of length ln with index l over R is viewed both as in the conventional row circulant form and also as an R[x]/(x − 1)-submodule of GR(R, l)[x]/(x − 1), where GR(R, l) is the Galois extension ring of degree l over R. A necessary ...
متن کاملOn quasi-cyclic codes as a generalization of cyclic codes
In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length lm and ideals of Ml(Fq)[X]/(X m −1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2021
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2021.3111858